Optimal Description of Automatic Paperfolding Sequences
نویسنده
چکیده
The class of 2-automatic paperfolding sequences corresponds to the class of ultimately periodic sequences of unfolding instructions. We rst show that a paper-folding sequence is automatic ii it is 2-automatic. Then we provide families of minimal nite-state automata, minimal uniform tag sequences and minimal substitutions describing automatic paperfolding sequences, as well as a family of algebraic equations satissed by automatic paperfolding sequences understood as formal power series.
منابع مشابه
Paperfolding and Catalan numbers
1 : This paper reproves a few results concerning paperfolding sequences using properties of Catalan numbers modulo 2. The guiding principle can be described by: Paperfolding = Catalan modulo 2 + signs given by 2−automatic sequences.
متن کاملan 2 01 1 Paperfolding morphisms , planefilling curves , and fractal tiles
An interesting class of automatic sequences emerges from iterated paperfolding. The sequences generate curves in the plane with an almost periodic structure. We generalize the results obtained by Davis and Knuth on the self-avoiding and planefilling properties of these curves, giving simple geometric criteria for a complete classification. Finally, we show how the automatic structure of the seq...
متن کاملIrrationality measures for some automatic real numbers
This paper is devoted to the rational approximation of automatic real numbers, that is, real numbers whose expansion in an integer base can be generated by a finite automaton. We derive upper bounds for the irrationality exponent of famous automatic real numbers associated with the Thue–Morse, Rudin–Shapiro, paperfolding and Baum–Sweet sequences. These upper bounds arise from the construction o...
متن کاملSummation of Rational Series Twisted by Strongly $B$-multiplicative Coefficients
We evaluate in closed form series of the type ∑ u(n)R(n), with (u(n))n a strongly B-multiplicative sequence and R(n) a (well-chosen) rational function. A typical example is: ∑ n>1 (−1)2 4n+ 1 2n(2n+ 1)(2n+ 2) = − 4 where s2(n) is the sum of the binary digits of the integer n. Furthermore closed formulas for series involving automatic sequences that are not strongly B-multiplicative, such as the...
متن کاملLeast periods of k-automatic sequences
Currie and Saari initiated the study of least periods of infinite words, and they showed that every integer n ≥ 1 is a least period of the Thue-Morse sequence. We generalize this result to show that the characteristic sequence of least periods of a k-automatic sequence is (effectively) k-automatic. Through an implementation of our construction, we confirm the result of Currie and Saari, and we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. UCS
دوره 3 شماره
صفحات -
تاریخ انتشار 1997